Time complexity - PDFSEARCH.IO - Document Search Engine

Time complexity
Results: 894

#	Item
371	A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set Marek Karpinski1 ? , Andrzej Lingas2 1 ?? Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2015-02-23 03:33:24 Geometry Spanning tree Polygons Catalan number Dynamic programming Simple polygon Time complexity Polygon triangulation Delaunay triangulation Mathematics Theoretical computer science Triangulation
372	Constant-Time Testing and Learning of Image Properties (full version) arXiv:1503.01363v2 [cs.DS] 6 MarPiotr Berman∗ Add to Reading List Source URL: arxiv.org Language: English - Date: 2015-03-08 21:15:52 Analysis of algorithms Computational complexity theory Approximation algorithms Property testing Time complexity Algorithm Randomized algorithm Theoretical computer science Applied mathematics Mathematics
373	Querying Approximate Shortest Paths in Anisotropic Regions∗ Siu-Wing Cheng† Hyeon-Suk Na‡ Antoine Vigneron§ Add to Reading List Source URL: www.cs.ust.hk Language: English - Date: 2010-04-22 09:35:25 Search algorithms Computational geometry Combinatorial optimization Routing algorithms Network theory Shortest path problem Voronoi diagram Point location Time complexity Theoretical computer science Mathematics Computational complexity theory
374	HASH SORT: A LINEAR TIME COMPLEXITY MULITIPLE-DIMENSIONAL SORT ALGORITHM ORIGINALLY ENTITLED ”MAKING A HASH OF SORTS” ∗ Add to Reading List Source URL: arxiv.org Language: English - Date: 2008-02-01 14:49:02 Information science Artificial intelligence Hash function Perfect hash function Cryptographic hash function Trie Collision Hash table Linear probing Hashing Search algorithms Information retrieval
375	Local reductions Hamid Jahanjou∗ Eric Miles∗ Emanuele Viola∗ Add to Reading List Source URL: www.ccs.neu.edu Language: English - Date: 2014-04-01 09:13:02 Complexity classes Circuit complexity Boolean algebra NP-complete problems Time complexity ACC0 Cook–Levin theorem P NC Theoretical computer science Computational complexity theory Applied mathematics
376	Journal of Artificial Intelligence Research234 Submitted 8/14; published 1/15 On the Subexponential-Time Complexity of CSP Ronald de Haan Add to Reading List Source URL: www.jair.org Language: English - Date: 2015-01-30 21:27:29 Constraint programming Constraint satisfaction problem Constraint satisfaction Exponential time hypothesis Boolean satisfiability problem NP-complete Tree decomposition Conjunctive normal form Time complexity Theoretical computer science Applied mathematics Computational complexity theory
377	Multi-processor Scheduling to Minimize Flow Time with Resource Augmentation Chandra Chekuri Ashish Goel ∗ Add to Reading List Source URL: www.cse.iitd.ernet.in Language: English - Date: 2005-08-24 06:29:40 Analysis of algorithms Computational complexity theory Probabilistic complexity theory Randomized algorithm Algorithm Big O notation Job shop scheduling David Shmoys Theoretical computer science Applied mathematics Mathematics
378	UNIVERSITY OF CALIFORNIA, RIVERSIDE DEPARTMENT OF COMPUTER SCIENCE 2006 DEPTH EXAMINATION IN THEORY OF OF COMPUTATION AND ALGORITHMS • There are 10 problems on the test. Each problem is worth 10 points. The ordering o Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2007-02-09 21:58:07 NP Time complexity P FL FO Turing machine Computational complexity theory Theoretical computer science Applied mathematics Complexity classes
379	Matrix-Vector Multiplication in Sub-Quadratic Time (Some Preprocessing Required) Ryan Williams∗ Abstract We show that any n × n matrix A over any finite semiring can be preprocessed in O(n2+ε ) Add to Reading List Source URL: web.stanford.edu Language: English - Date: 2006-10-02 16:50:12 Matrices Matrix theory Computational complexity theory Digital signal processing Fast Fourier transform Adjacency matrix Matrix multiplication Shortest path problem Semiring Mathematics Algebra Abstract algebra
380	Multi-Scale Matrix Sampling and Sublinear-Time PageRank Computation∗ arXiv:1202.2771v5 [cs.DS] 28 MayChristian Borgs† Add to Reading List Source URL: arxiv.org Language: English - Date: 2013-05-28 20:02:47 Applied mathematics Crowdsourcing PageRank Reputation management Search engine optimization Power iteration Time complexity Google matrix CheiRank Theoretical computer science Markov models Link analysis

UPDATE